Linear time minimum segmentation enables scalable founder reconstruction
نویسندگان
چکیده
منابع مشابه
Linear - Time Heuristics for Minimum
We consider the problem of partitioning rectilinear polygons into rectangles, using segments of minimum total length. This problem is NP-hard for polygons with holes. Even for hole-free polygons no known algorithm can nd an optimal partitioning in less than O(n 4) time. We present the rst linear-time algorithm for computing rectangula-tions of hole-free polygons, within a constant factor of the...
متن کاملLinear-Time Surface Reconstruction
By now it is moderately well understood how to take as input a set of points that lie on an unknown manifold, and produce as output a piecewise linear approximation to the manifold. The question I explore here is: how fast can we do it? Previous solutions achieve a sequential runtime of O(n log n) in low ambient dimensions. I show that if the points are specified in floating point coordinates, ...
متن کاملArc Segmentation in Linear Time
A linear algorithm based on a discrete geometry approach is proposed for the detection of digital arcs and digital circles using a new representation of them. It is introduced by inspiring from the work of Latecki [1]. By utilizing this representation, we transform the problem of digital arc detection into a problem of digital straight line recognition. We then develop a linear method for arc s...
متن کاملStable Minimum Space Partitioning in Linear Time
In the stable 0-1 sorting problem the task is to sort an array of n elements with two distinct values such that equal elements retain their relative input order. Recently, Munro, Raman and Salowe [BIT 1990] gave an algorithm which solves this problem in O(nlog*n)3 time and constant extra space. We show that by a modification of their method the stable 0-1 sorting is possible in O(n) time and O(...
متن کاملSegmentation/Reconstruction of Range Images Based on Piecewise-Linear Approximation
A technique for segmenting and reconstructing range images of polyhedral objects is presented. A piecewise-linear approximation based on a triangulation of the image is computed rst. Optimization techniques are applied next to detect jump and crease edges, to eliminate false boundaries, and to merge nearly coplanar triangles into larger polygonal patches.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms for Molecular Biology
سال: 2019
ISSN: 1748-7188
DOI: 10.1186/s13015-019-0147-6